Reconstructing hv-Convex Polyominoes from Orthogonal Projections

نویسندگان

  • Christoph Dürr
  • Marek Chrobak
چکیده

Tomography is the area of reconstructing objects from projections. In discrete tomography an object T we wish to reconstruct may be a set of cells of a multidimensional grid. We perform measurements of T , each one involving a projection that determines the number of cells in T on all lines parallel to the projection’s direction. Given a finite number of such measurements, we wish to reconstruct T or, if unique reconstruction is not possible, to compute any object consistent with these projections. Gardner et al. [7] proved that deciding if there is an object consistent with given measurements is NP-complete, even for three non-parallel projections in the 2D grid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstruction of convex polyominoes from orthogonal projections of their contours

The problem of reconstructing a convex polyominoes from its horizontal and vertical projections when the projections are defined as the number of cells of the polyomino in the different lines and columns was studied by Del Lungo and M. Nivat (cf [7]). In this paper we study the reconstruction of any convex polyomino when the orthogonal projections are defined as the contour length of the object...

متن کامل

The Reconstruction of Polyominoes from Approximately Orthogonal Projections

The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will pr...

متن کامل

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections

Reconstructing discrete bidimensional sets from their projections is involved in many different problems of computer-aided tomography, pattern recognition, image processing and data compression. In this paper, we examine the problem of reconstructing a discrete bidimensional set S satisfying some convexity conditions from its two orthogonal projections (H, v). We develop an algorithm that start...

متن کامل

Reconstructing hv-convex polyominoes with multiple colours

This thesis examines the problem of reconstructing multiple discrete 2D objects, represented by a set of cells arranged in an m×n grid, from their projections. The objects being constructed are disjoint, hv-convex polyominoes, each of which has a separate colour. The main results presented here are two algorithms for unordered C-colour reconstruction that have time complexities of O(Cnm) and O(...

متن کامل

Reconstruction of 2-convex polyominoes

There are many notions of discrete convexity of polyominoes (namely hvconvex [1], Q-convex [2], L-convex polyominoes [5]) and each one has been deeply studied. One natural notion of convexity on the discrete plane leads to the definition of the class of hv-convex polyominoes, that is polyominoes with consecutive cells in rows and columns. In [1] and [6], it has been shown how to reconstruct in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 69  شماره 

صفحات  -

تاریخ انتشار 1999